Results on the quantitative μ-calculus qM μ
نویسندگان
چکیده
منابع مشابه
The Quantitative Μ-calculus Diplom-informatikerin
This thesis studies a generalisation of the modal μ-calculus, a modal fixedpoint logic that is an important specification language in formal verification. We define a quantitative generalisation of this logic, meaning that formulae do not just evaluate to true or false anymore but instead to arbitrary real values. First, this logic is evaluated on a quantitative extension of transition systems ...
متن کاملModel Checking the Quantitative μ-Calculus on Linear Hybrid Systems
In this work, we consider the model-checking problem for a quantitative extension of the modal μ-calculus on a class of hybrid systems. Qualitative model checking has been proved decidable and implemented for several classes of systems, but this is not the case for quantitative questions, which arise naturally in this context. Recently, quantitative formalisms that subsume classical temporal lo...
متن کاملLectures on the modal μ-calculus
These notes give an introduction to the theory of the modal μ-calculus and other modal fixpoint logics. ∗Institute for Logic, Language and Computation, University of Amsterdam, Science Park 904, NL–1098XH Amsterdam. E-mail: [email protected].
متن کاملŁukasiewicz μ-calculus
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کاملŁukasiewicz μ - calculus Matteo Mio
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2007
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1182613.1182616